Embedding various even cycles in a hypercube with node failures
نویسنده
چکیده
Let fv denote the number of faulty vertices in an n-dimensional hypercube Qn. In this paper, we prove that every fault-free edge of Qn for n ≥ 4 and every fault-free vertex of Qn for n ≥ 3 lies on a fault-free cycle of every even length from 6 to 2 − 2fv inclusive if fv = n− 1, and all faulty vertices are not adjacent to the same vertex.
منابع مشابه
Hamiltonian Cycle Embedding for Fault Tolerance in Dual-cube
The hypercube has been widely used as the interconnection network (IN) in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube), one more link is used for connecting to a...
متن کاملPancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network
We show that the hierarchical cubic network, an alternative to the hypercube, is hamiltonian-connected using Gray codes. A network is hamiltonian-connected if it contains a hamiltonian path between every two distinct nodes. In other words, a hamiltonian-connected network can embed a longest linear array between every two distinct nodes with dilation, congestion, load, and expansion equal to one...
متن کاملCycles Embedding Problem in Hierarchical Hypercube Networks
The hierarchical hypercube network is suitable for massively parallel systems. The number of links in the hierarchical hypercube network forms a compromise between those of the hypercube and the cube-connected cycles. Recently, some interesting properties of the hierarchical hypercube network were investigated. Since the hierarchical hypercube is bipartite. A bipartite graph is bipancyclic if i...
متن کاملOn conditional edge-fault-tolerant cycles embedding of hypercubes
The hypercube has been one of the most popular interconnection networks for parallel computer/communication system. In this papers, we assume that each node is incident with at least two fault-free links. Under this assumption, we show that every fault-free edge lies on a fault-free cycle of every even length from 6 to 2 inclusive even if it has up to 2n − 5 link faults. The result is optimal w...
متن کاملEmbedding Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles into Twisted Cubes
The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant Hamiltonicity of an interconnection network. Two node-disjoint cycles in a network are called equal if the number of nodes in the...
متن کامل